Surface Parameterization For Meshing by Triangulation Flattening
نویسندگان
چکیده
We propose a new method to compute planar triangulations of triangulated surfaces for surface parameterization. Our method computes a projection that minimizes the distortion of the surface metric structures (lengths, angles, etc.). It can handle any manifold surface, including surfaces with large curvature gradients and non-convex domain boundaries. We use only the necessary and suucient constraints for a valid two-dimensional triangulation. As a result, the existence of a theoretical solution to the minimization procedure is guaranteed.
منابع مشابه
Surface Parameterization for Meshing by Triangulation Flattening
We propose a new method to compute planar triangulations of triangulated surfaces for surface parameterization. Our method computes a projection that minimizes the distortion of the surface metric structures (lengths, angles, etc.). It can handle any manifold surface for which a connected, valid, two-dimensional parameterization exists, including surfaces with large curvature gradients and non-...
متن کاملNon-Distorted Texture Mapping Using Angle Based Flattening
This article introduces a new method for surface parameterization for texture mapping. In the first step of the algorithm we compute a planar triangulation of the faceted surface, using an Angle Based Flattening (ABF) formulation. This provides a mapping function from a three-dimensional surface to the plane. The ABF formulation defines the flattening problem as a constrained minimization probl...
متن کاملAnisotropic surface meshing with conformal embedding
This paper introduces a parameterization-based approach for anisotropic surface meshing. Given an input surface equipped with an arbitrary Riemannian metric, this method generates a metric-adapted mesh with user-specified number of vertices. In the proposed method, the edge length of the input surface is directly adjusted according to the given Riemannian metric at first. Then the adjusted surf...
متن کاملDirect quad-dominant meshing of point cloud via global parameterization
In this paper, we present a new algorithm for quad-dominant meshing of unorganized point clouds based on periodic global parameterization. Our meshing method is guided by principal directions so as to preserve the intrinsic geometric properties. We use local Delaunay triangulation to smooth the initial principal directions and adapt the global parameterization to point clouds. By optimizing the...
متن کاملFlattening 3D Triangulations for Quality Surface Mesh Generation
A method of flattening 3D triangulations for use in surface meshing is presented. The flattening method supports multiple boundary loops and directly produces planar locations for the vertices of the triangulation. The general nonlinear least-square fit condition for the triangle vertices includes conformal (angle preserving) and authalic (area preserving) conditions as special cases. The metho...
متن کامل